Minimum Rate Guaranteed Call Admission Control for Cumulative Rate Distribution Based Scheduling
نویسندگان
چکیده
منابع مشابه
Core-Stateless Guaranteed Rate Scheduling Algorithms
Many per-flow scheduling algorithms have been proposed to provide rate and delay guarantees to flows. It is often argued that the need for maintaining per-flow state and performing per-packet classification seriously limits the scalability of routers that employ such per-flow scheduling algorithms. Consequently, design of algorithms that can provide per-flow rate and delay guarantees without re...
متن کاملCall admission control with opportunistic scheduling scheme
In this paper, a rate-based admission control scheme for a single shared wireless base station with opportunistic scheduling and adaptive modulation and coding (AMC) is proposed. The proposed admission scheme maintains minimum average rates of the admitted users, i.e., new users will be admitted if the base station has enough resources to support the requiredminimum average transmission rates o...
متن کاملEnd - to - End Call Admission Control in Service Guaranteed Networks ∗
A per-connection end-to-end call admission control (CAC) problem is solved in this paper to allocate network resources to an input session to guarantee its quality of service (Qos) requirements. In conjunction with the solution of the CAC problem, a traffic descriptor is proposed to describe the loss rate and the delay bound Qos requirements of the connection to be set up as well as the statist...
متن کاملRobust scheduling algorithm for guaranteed bit rate services
This paper proposes a novel packet scheduling algorithm to overcome detrimental effects of channel impairments on the quality of service of delay-sensitive Guaranteed Bit Rate (GBR) services. The proposed algorithm prioritises the packets that require retransmission of Hybrid Automatic Repeat Request (HARQ) users compared to the packets of new users. The packets of new users are scheduled accor...
متن کاملFast Admission Control for Rate Monotonic Schedulers
Rate monotonic traffic scheduling algorithm had been shown [1] to be the optimal static priority assignment scheme. The system model studied in [1] can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2011
ISSN: 1089-7798
DOI: 10.1109/lcomm.2011.082911.111134